JCOL: A Java package for solving the graph coloring problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSecurely Solving the Distributed Graph Coloring Problem
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all...
متن کاملSolving the Graph Coloring Problem Using Cuckoo Search
We adapt the Cuckoo Search (CS) algorithm for solving the three color Graph Coloring Problem (3-GCP). The difficulty of this task is adapting CS from a continuous to a discrete domain. Previous researches used sigmoid functions to discretize the Lévi Flight (LF) operator characteristic of CS, but this approach does not take into account the concept of Solution Distance, one of the main characte...
متن کاملParallel Graph Coloring Using Java
In this paper a parallel, pipeline oriented version of a well-known sequential graph coloring heuristic is introduced. Runtime and speedup results of an implementation in JAVA on a four processor machine are presented and discussed.
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Open Source Software
سال: 2020
ISSN: 2475-9066
DOI: 10.21105/joss.01843